Search results for "network [detector]"
showing 10 items of 496 documents
CORPORATE VENTURE CAPITAL SYNDICATION STRATEGIES: A DYNAMIC NETWORK PERSPECTIVE
2018
Corporate Venture Capital (CVC) syndication is embraced by over 80% of corporates which co-investing the same startups with other corporates create a CVC syndication network. In this paper, we aim at exploring the evolutionary dynamics of the CVC syndication network. Specifically, we address this topic adopting two different perspectives. First, we investigate the architectural evolution of the CVC syndication network examining five dimensions that characterize the evolution of the network structure (i.e. degree distribution, connectivity, clustering, density and degree assortativity). In addition, we study how three network strategies (i.e. prominence, entrepreneurial and relational) evolv…
The mixed capacitated general routing problem with turn penalties
2011
In this paper we deal with the mixed capacitated general routing problem with turn penalties. This problem generalizes many important arc and node routing problems, and it takes into account turn penalties and forbidden turns, which are crucial in many real-life applications, such as mail delivery, waste collection and street maintenance operations. Through a polynomial transformation of the considered problem into a Generalized Vehicle routing problem, we suggest a new approach for solving this new problem by transforming it into an Asymmetric Capacitated Vehicle routing problem. In this way, we can solve the new problem both optimally and heuristically using existing algorithms. A powerfu…
Ģimenes anamnēzes raksturojums pacientiem ar primāru hiperlipidēmiju
2018
Tēmas aktualitāte: Ģimenes hiperholesterinēmija (ĢH) ir autosomāli ominant slimība, kas savlaicīgi neatpazīstot un neuzsākot atbilstošu terapiju, var rezultēties agrīnos kardiovaskulāros notikumos. Latvija ir pirmā no Baltijas valstīm, kur funkcionē ĢH reģistrs. Mērķis: Raksturot ģimenes anamnēzes datu pieejamību pacientiem, kas iekļauti LĢRH. Materiāli un metodes: Tika analizēta ģimenes slimības vēstures datu pieejamība, izmantojot LĢHR pacientu anketas. Rezultāti: Līdz 2017. gada oktobrim LĢHR tika iekļauti 356 pacienti, no kuriem 294 (82.6%) bija probandi un 62 ( 17.4%) pirmās pakāpes radinieki. Klīniska ĢH tika diagnosticēta 164 pacientiem (131 probandam un 33 pirmās pakāpes radiniekiem…
Toward Engineering Chiral Rodlike Metal-Organic Frameworks with Rare Topologies.
2018
The establishment of novel design strategies to target chiral rodlike MOFs, elusively faced until now, is one of the most straightforward manners to widen the scope of MOFs. Here we describe our last advances on the application of the metalloligand design strategy toward the development of efficient routes to obtain chiral rodlike MOFs. To this end, we have used as precursor an enantiopure homochiral hexanuclear wheel (1), derived from the amino acid d-valine, which, after a supramolecular reorganization into a one-dimensional homochiral chain-with the same configuration as 1-led to the formation of a homochiral rodlike MOF (2) exhibiting rare etd topology.
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
2001
We describe algorithms for pattern-matching and pattern-learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted class of ordered graphs. We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the given set of data. The maximal common subgraph problem then is solved by repeated subgraph extension and checking for isomorphisms. Despite its apparent inefficiency, this approach yields an algorithm with time complexity proportional to the number of graphs in the input set and is still practical on the given set of data. As a…
Algorithms for Graph and Network Analysis: Clustering and Search of Motifs in Graphs
2019
In this article we deal with problems that involve the analysis of topology in graphs modeling biological networks. In particular, we consider two important problems: (i) Network clustering, aiming at finding compact subgraphs inside the input graph in order to isolate molecular complexes, and (ii) searching for motifs, i.e., sub-structures repeated in the input network and presenting high significance (e.g., in terms of their frequency). We provide a compact overview of the main techniques proposed in the literature to solve these problems.
Network structure and optimal technological innovation
2019
The role of networks in the emergence, diffusion and evolution of technological innovations has attracted much theoretical and empirical attention. Yet, much of the work has explored the role of undirected and homogeneous networks. In real cases, many networks are directed. The flow of information, benefits or observations is directed from one node towards another node. Real networks are also heterogeneous, for example, few nodes have a high degree while many others have a low degree. In this article, we report on the results of an evolutionary agent-based model in which a group of agents, in our case firms, collectively search a complex (rugged) technological landscape and observe each oth…
Performance comparison of container orchestration platforms with low cost devices in the fog, assisting Internet of Things applications
2020
Abstract In the last decade there has been an increasing interest and demand on the Internet of Things (IoT) and its applications. But, when a high level of computing and/or real time processing is required for these applications, different problems arise due to their requirements. In this context, low cost autonomous and distributed Small Board Computers (SBC) devices, with processing, storage capabilities and wireless communications can assist these IoT networks. Usually, these SBC devices run an operating system based on Linux. In this scenario, container-based technologies and fog computing are an interesting approach and both have led to a new paradigm in how devices cooperate, improvi…
Does higher datarate perform better in IEEE 802.11-based multihop ad hoc networks?
2007
Due to the nature that high datarate leads to shorter transmission range, the performance enhancement by high datarate 802.11 WLANs may be degraded when applying high datarate to an 802.11 based multihop ad hoc network. In this paper, we evaluate, through extensive simulations, the performance of multihop ad hoc networks at multiple transmission datarates, in terms of the number of hops between source and destination, throughput, end-to-end delay and packet loss. The study is conducted based on both stationary chain topology and mesh topologies with or without node mobility. From numerical results on network performance based on chain topology, we conclude that there is almost no benefit by…
Architectures and protocols for mobile computing applications: a reconfigurable approach
2004
This work deals with reconfigurable control functions and protocols for supporting mobile computing applications in heterogeneous wireless systems like cellular networks and WLANs. The control functions are implemented in a software module, named Reconfigurable Access module for MObile computiNg applications (RAMON), placed in mobile and/or base stations. RAMON operates on abstract models of the main communication functions of a wireless systems (e.g., transmission over the radio channel, coding end error recovery, capacity sharing and packet scheduling, handover, congestion control, etc.). RAMON algorithms are programmed with reference to the abstract models, independently of specific radi…